Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 52/115

Q: Select the code snippet which performs pre-order traversal.
A. public void preorder(Tree root) { System.out.println(root.data); preorder(root.left); preorder(root.right); }
B. public void preorder(Tree root) { preorder(root.left); System.out.println(root.data); preorder(root.right); }
C. public void preorder(Tree root) { System.out.println(root.data); preorder(root.right); preorder(root.left); }
D. public void preorder(Tree root) { preorder(root.right); preorder(root.left); System.out.println(root.data); }
Solution: Pre-order traversal follows NLR(Node-Left-Right).
Q: Select the code snippet which performs post-order traversal.
A. public void postorder(Tree root) { System.out.println(root.data); postorder(root.left); postorder(root.right); }
B. public void postorder(Tree root) { postorder(root.left); postorder(root.right); System.out.println(root.data); }
C. public void postorder(Tree root) { System.out.println(root.data); postorder(root.right); postorder(root.left); }
D. public void postorder(Tree root) { postorder(root.right); System.out.println(root.data); postorder(root.left); }
Solution: Post order traversal follows NLR(Left-Right-Node).
Q: Select the code snippet that performs pre-order traversal iteratively.
A. public void preOrder(Tree root) { if (root == null) return; Stack stk = new Stack(); st.add(root); while (!stk.empty()) { Tree node = stk.pop(); System.out.print(node.data + " "); if (node.left != null) stk.push(node.left); if (node.right != null) stk.push(node.right); } }
B. public void preOrder(Tree root) { if (root == null) return; Stack stk = new Stack(); while (!stk.empty()) { Tree node = stk.pop(); System.out.print(node.data + " "); if (node.right != null) stk.push(node.right); if (node.left != null) stk.push(node.left); } }
C. public void preOrder(Tree root) { if (root == null) return; Stack stk = new Stack(); st.add(root); while (!stk.empty()) { Tree node = stk.pop(); System.out.print(node.data + " "); if (node.right != null) stk.push(node.right); if (node.left != null) stk.push(node.left); } }
D. public void preOrder(Tree root) { if (root == null) return; Stack stk = new Stack(); st.add(root); while (!stk.empty()) { Tree node = stk.pop(); System.out.print(node.data + " "); if (node.right != null) stk.push(node.left); if (node.left != null) stk.push(node.right); } }
Solution: Add the root to the stack first, then continously check for the right and left children of the top-of-the-stack.
Q: Select the code snippet that performs post-order traversal iteratively.
A. public void postorder(Tree root) { if (root == null) return; Stack stk = new Stack(); Tree node = root; while (!stk.isEmpty() || node != null) { while (node != null) { if (node.right != null) stk.add(node.left); stk.add(node); node = node.right; } node = stk.pop(); if (node.right != null && !stk.isEmpty() && node.right == stk.peek())
B. public void postorder(Tree root) { if (root == null) return; Stack stk = new Stack(); Tree node = root; while (!stk.isEmpty() || node != null) { while (node != null) { if (node.right != null) stk.add(node.right); stk.add(node); node = node.left; } node = stk.pop(); if (node.right != null && !stk.isEmpty() && node.right == stk.peek(
C. public void postorder(Tree root) { if (root == null) return; Stack stk = new Stack(); Tree node = root; while (!stk.isEmpty() || node != null) { while (node != null) { if (node.right != null) stk.add(node.right); stk.add(node); node = node.left; } node = stk.pop(); if (node.right != null) { Trees nod
D. public void postorder(Tree root) { if (root == null) return; Stack stk = new Stack(); Tree node = root; while (!stk.isEmpty() || node != null) { while (node != null) { if (node.right != null) stk.add(node.left); stk.add(node); node = node.left; } node = stk.pop(); if (node.right != null) { Trees node
Solution: The left and right children are added first to the stack, followed by the node, which is then popped. Post-order follows LRN policy.
Q: What is the time complexity of pre-order traversal in the iterative fashion?
A. O(1)
B. O(n)
C. O(logn)
D. O(nlogn)
Solution: Since you have to go through all the nodes, the complexity becomes O(n).
Q: What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
A. O(1)
B. O(nlogd)
C. O(logd)
D. O(d)
Solution: In the worst case we have d stack frames in the recursive call, hence the complexity is O(d).
Q: To obtain a prefix expression, which of the tree traversals is used?
A. Level-order traversal
B. Pre-order traversal
C. Post-order traversal
D. In-order traversal
Solution: As the name itself suggests, pre-order traversal can be used.
Q: Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is _________
A. A, C, D, B, E
B. A, B, C, D, E
C. A, B, C, E, D
D. D, B, E, A, C
Solution: The inorder sequence is B, E, A, D, C and Preorder sequence is A, B, E, C, D. The tree constructed with the inorder and preorder sequence is The levelorder traversal (BFS traversal) is A, B, C, E, D.
Q: Consider the following data and specify which one is Preorder Traversal Sequence, Inorder and Postorder sequences.
S1: N, M, P, O, Q
S2: N, P, Q, O, M
S3: M, N, O, P, Q
A. S1 is preorder, S2 is inorder and S3 is postorder
B. S1 is inorder, S2 is preorder and S3 is postorder
C. S1 is inorder, S2 is postorder and S3 is preorder
D. S1 is postorder, S2 is inorder and S3 is preorder
Solution: Preorder traversal starts from the root node and postorder and inorder starts from the left child node of the left subtree. The first node of S3 is different and for S1 and S2 it’s the same. Thus, S3 is preorder traversal and the root node is M. Postorder traversal visits the root node at last. S2 has the root node(M) at last that implies S2 is postorder traversal. S1 is inorder traversal as S2 is postorder traversal and S3 is preorder traversal. Therefore, S1 is inorder traversal, S2 is postorder traversal and S3 is preorder traversal.

You Have Score    /9